Subdirect decomposition of distributive quasilattices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Structure of Pseudocomplemented Distributive Lattices. I: Subdirect Decomposition

In this paper all subdirectly irreducible pseudocomplemented distributive lattices are found. This result is used to establish a Stone-like representation theorem conjectured by G. Grätzer and to find all equational subclasses of the class of pseudocomplemented distributive lattices.

متن کامل

A Subdirect-union Representation for Completely Distributive Complete Lattices

4. Proof of Theorem 2. Harish-Chandra [l] and others have proved that every Lie algebra over a field of characteristic zero has a faithful representation. Consequently by Lemma 4, 8 has a faithful representation x—*Qx whose matrices have elements in an algebraic extension $ of g such that t(QxQv) =0 for all x of 31 and all y of 8. We now apply another form of Cartan's criterion for solvability ...

متن کامل

Subdirect Decomposition of n-Chromatic Graphs

It is shown that any n-chromatic graph is a full subdirect product of copies of the complete graphs Kn and Kn+1, except for some easily described graphs which are full subdirect products of copies of Kn+1 − {◦–◦} and Kn+2 − {◦–◦}; full means here that the projections of the decomposition are epimorphic in edges. This improves some results of Sabidussi. Subdirect powers of Kn or Kn+1 − {◦–◦} are...

متن کامل

Effective Subdirect Decomposition: A Case Study

Certainly, one of the most fundamental early results in universal algebra is Birkhoff’s 1944 decomposition theorem which states that every (universal) algebra d may be represented as a subdirect product of subdirectly irreducible algebras of the same type. It is clear that for d finite such decompositions may be obtained effectively, at least in principle. At first sight, therefore, one might b...

متن کامل

Subdirect Decomposition of Contexts into Subdirectly Irreducible Factors

The size of a concept lattice may increase exponentially with the size of the context. When the number of nodes is too large, it becomes very difficult to generate and study such a concept lattice. A way to avoid this problem is to break down the lattice into small parts. In the subdirect decomposition, the small parts are factor lattices which are meaningful in the Formal Concept Analysis (FCA...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 1971

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm-71-2-161-163